package main

func main()  {
	
}

type nodelist struct {
	val int
	next *nodelist
}

func delNNode(head *nodelist, n int)  {
	k :=0
	left := head
	right := head
	for right.next != nil && k<n {
		right = right.next
	}

	if k < n {
		return
	}
	for right.next != nil {
		left = left.next
		right = right.next
	}

	node :=left.next
	left.next = node.next
	node.next = nil

}
